Games for Logic and Concurrency
نویسندگان
چکیده
4 Literature review 8 4.1 Modal and Temporal Logics . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.2 Games for Modal and Temporal Logics . . . . . . . . . . . . . . . . . . . . 9 4.3 Models of Concurrency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Games for Models of Concurrency . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Lattices and Complete lattices . . . . . . . . . . . . . . . . . . . . . . . . 10 4.6 Closure operators and Galois connections . . . . . . . . . . . . . . . . . . 11 4.7 Fixpoint Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
منابع مشابه
Games and Modal Mu-Calculus
We deene Ehrenfeucht-Fra ss e games which exactly capture the expressive power of the extremal xed point operators of modal mu-calculus. The resulting games have signiicance, we believe, within and outside of concurrency theory. On the one hand they naturally extend the iterative bisimulation games associated with Hennessy-Milner logic, and on the other hand they ooer deeper insight into the lo...
متن کاملLogics and Games for True Concurrency
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a uniform way by two simple and general dualities of local behaviour. Such dualities are used to define new mu-calculi and logic games for the analysis of concurren...
متن کاملSequentiality vs. Concurrency in Games and Logic
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic. We use Games and Logic as a mirror to understand an aspect of the sequentiality/concurrency distinction. We begin with the simple, intuitive notion of polarized games due to Blass (Blass 1972; Blass 1992), which prefigured many of the i...
متن کاملOn bisimulation and model-checking for concurrent systems with partial order semantics
In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where multiple actions or events can happen independently and at the same time: either with interleaving or with partial order semantics. On the one hand, the interleaving semantics a...
متن کاملPartial-order Boolean games: informational independence in a logic-based model of strategic interaction
As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a ga...
متن کامل